|
|
Multicriteria graph partitioning
Houška, Ondřej ; Tůma, Miroslav (advisor) ; Hnětynková, Iveta (referee)
The thesis is about graph partitioning and applications of graph partitioning in paral- lel algorithms for solving big sparse linear equations. The problem of graph partitioning is thorougly described and standard graph partitioning algorithms are explained. The appli- cation part is focusing on the Conjugate Gradient method preconditioned by a variant of incomplete Cholesky factorization based on drop tolerance. The role of graph partitioning in the problem decomposition is described and a load balancing problem is studied. 1
|
|
|
Metoda sdružených gradientů
Segeth, Karel
The endeavour to solve systems of linear algebraic systems is already two thousand years old. In the paper we consider the conjugate gradient method that is (theoretically) finite but, in practice, it can be treated as an iterative method. We survey a known modification of the method, the preconditioned conjugate gradient method, that may converge faster than the original one.
|
|
| |
|
| |
|
| |
|
|
Iterační řešení soustav sedlového bodu: stručný přehled
Rozložník, Miroslav
In this contribution we attempt to review recent advances in the field of iterative methods for solving large saddle point problems. The main focus is on developments in the area of Krylov subspace methods and block preconditioning techniques for symmetric and nonsymmetric linear systems that arise in the context of solving the saddle point problems.
|
guest ::
